Asymptotic Enumeration of Hypergraphs by Degree Sequence
نویسندگان
چکیده
We prove an asymptotic formula for the number of k-uniform hypergraphs with a given degree sequence, wide range parameters. In particular, we find that is asymptotically equal to d-regular on n vertices provided dn ≤ c(n/k) constant c > 0, and 3 k < n^c any C 1/9. Our results relate sequence random hypergraph simple model nearly independent binomial variables, thus extending recent graphs due second third author.
منابع مشابه
Asymptotic Enumeration by Degree Sequence of Graphs of High Degree
We consider the estimation of the number of labelled simple graphs with degree sequence d1, d2, . . . , dn by using an n-dimensional Cauchy integral. For suffiently small and any c > 2 3 , an asymptotic formula is obtained when |di − d| < n for all i and d = d(n) satisfies min{d, n − d − 1} ≥ cn/ log n as n → ∞. These conditions include the degree sequences of almost all graphs, so our result g...
متن کاملAsymptotic enumeration by degree sequence of graphs with degress o(n1/2)
We determine the asymptotic number of labelled graphs with a given degree sequence for the case where the maximum degree is o(|E(G)|). The previously best enumeration, by the first author, required maximum degree o(|E(G)|). In particular, if k = o(n), the number of regular graphs of degree k and order n is asymptotically (nk)! (nk/2)! 2nk/2(k!)n exp ( − 2 − 1 4 − k 3 12n + O(k/n) ) . Under slig...
متن کاملAsymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees
A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For n ≥ 3, let r = r(n) ≥ 3 be an integer and let k = (k1, . . . , kn) be a vector of nonnegative integers, where each kj = kj(n) may depend on n. Let M = M(n) = ∑n j=1 kj for all n ≥ 3, and define the set I = {n ≥ 3 | r(n) divides ...
متن کاملAsymptotic enumeration of sparse uniform hypergraphs with given degrees
Let r ≥ 2 be a fixed integer. For infinitely many n, let k = (k1, . . . , kn) be a vector of nonnegative integers such that their sum M is divisible by r. We present an asymptotic enumeration formula for simple r-uniform hypergraphs with degree sequence k. (Here “simple” means that all edges are distinct and no edge contains a repeated vertex.) Our formula holds whenever the maximum degree kmax...
متن کاملAsymptotic enumeration of sparse graphs with a minimum degree constraint
We derive an asymptotic formula for the number of graphs with n vertices all of degree at least k, and m edges, with k fixed. This is done by summing the asymptotic formula for the number of graphs with a given degree sequence, all degrees at least k. This approach requires analysis of a set of independent truncated Poisson variables, which approximate the degree sequence of a random graph chos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in combinatorics
سال: 2022
ISSN: ['2517-5599']
DOI: https://doi.org/10.19086/aic.32357